Modeling Product Lines with Kripke Structures and Modal Logic

نویسندگان

  • Zinovy Diskin
  • Aliakbar Safilian
  • T. S. E. Maibaum
  • Shoham Ben-David
چکیده

Product lines are now an established framework for software design. They are specified by special diagrams called feature models. For formal analysis, the latter are usually encoded by propositional theories with Boolean semantics. We discuss a major deficiency of this semantics, and show that it can be fixed by considering that a product is an instantiation process rather than its final result. We call intermediate states of this process partial products, and argue that what a feature model M really defines is a poset of partial products called a partial product line, PPL(M). We argue that such PPLs can be viewed as special feature Kripke structures specifiable by a suitable version of CTL (feature CTL or fCTL). We show that any feature model M is representable by an fCTL theory Φ(M) such that for any feature Kripke structure K, K |= Φ(M) iff K = PPL(M); hence, Φ(M) is a sound and complete representation of the feature model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling and Model Checking Software Product Lines

Software product line engineering combines the individual developments of systems to the development of a family of systems consisting of common and variable assets. In this paper we introduce the process algebra PL-CCS as a product line extension of CCS and show how to model the overall behavior of an entire family within PL-CCS. PL-CCS models incorporate behavioral variability and allow the d...

متن کامل

On modal extensions of Product fuzzy logic

In this paper we study modal extensions of Product fuzzy logic with both relational semantics based on Kripke structures with crisp accessibility relations and algebraic semantics, when the underlying product fuzzy logic is expanded with truth-constants, the ∆ operator and with two infinitary inference rules. We provide completeness results for both kinds of semantics. Finally, we also consider...

متن کامل

Conceptual modeling in full computation-tree logic with sequence modal operator

In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗, is introduced as a Kripke semantics with a sequence modal operator. This logic can appropriately represent hierarchical tree structures in cases where sequence modal operators in CTLS∗ are applied to tree structures. We prove a th...

متن کامل

Using Modal Structures to Represent Extensions to Epistemic Logics

Kripke structures have been proposed as a semantic basis for modal logics of necessity and possibility. They consist of a set of states, informally interpreted as "possible worlds", and a binary accessibility relation between states. The primitive notion of a possible world in this context seems highly intuitive, since necessity can be interpreted as "truth in all possible worlds", and possibil...

متن کامل

Asymptotic Conditional Probability in Modal Logic: A Probabilistic Reconstruction of Nonmonotonic Logic

We analyze the asymptotic conditional validity of modal formulas, i.e., the probability that a formula ψ is valid in the finite Kripke structures in which a given modal formula φ is valid, when the size of these Kripke structures grows to infinity. We characterize the formulas ψ that are almost surely valid (i.e., with probability 1) in case φ is a flat, S5consistent formula, and show that thes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015